Optimal Routing in the Cube-Connected Cycles Interconnection Network
نویسنده
چکیده
An optimal message routing algorithm for thc cube-connected cycles processor interconnection network is described, and the average:message path length is derived assuming a uniform message routing distribution. The optimal algorithm is comparetl to one preViously proposed and is shown to have significanlly shorter average path length.
منابع مشابه
A Fault-tolerant Optimal Message Routing Methodology for Cube-connected-cycles Parallel Computers
A cube-connected-cycles (CCC) is a regular graph, suitable for constructing the interconnection network of parallel or multi-node computer systems. The CCC network possesses the features of symmetry, regularity, fault tolerance, and fixed degree of the network. Message delivery through an interconnection network sometimes fails due to processing node and/or link faults or simply because some pr...
متن کاملMultiprocessor Interconnection Networks
A deadlock-free routing algorithm can be generated for arbitrary interconnection networks using the concept of virtual channels. A necessary and sufficient condition for deadlock-free routing is the absence of cycles in a channel dependency graph. Given an arbitrary network and a routing function, the cycles of the channel dependency graph can be removed by splitting physical channels into grou...
متن کاملX-Cube: A Variation of Cube-Connected-Cycles Network With Lower Average Routing Steps
A fundamental and important research area in parallel computing is design of high-performance interconnection networks for connecting the processors in parallel computers. This paper presents a new interconnection network X-cube, a variant of the Cube-Connected-Cycles (CCC), which has the same degree, and same diameter in the worst case as the CCC of the same size and a decreased number of rout...
متن کاملShuffle-Ring: A New Constant-Degree Network
The hypercube as a parallel interconnection network has been of academic and engineering concern for tens of years due to its many merits. However, its increasing node degree is an obvious weakness. Some networks such as the cube-connected cycles (CCC) and the de Bruijn network have been proposed to overcome the increasing degree of the hypercube. In this paper, we present a new cost-effective ...
متن کاملLow Congested Interval Routing Schemes
In this paper we provide low-congested Interval Routing Schemes (IRS) for some common interconnection networks such as butterries, wrapped butterries and cube connected cycles. In particular, by exploiting their hypercube-like structure, we show that 1-IRS and 2-IRS are already suucient to get schemes with a congestion which is at most c times the optimal one, for low constant values of c. More...
متن کامل